Some symmetric semi-classical polynomial sets
نویسندگان
چکیده
منابع مشابه
On the isotypic decomposition of cohomology modules of symmetric semi-algebraic sets: polynomial bounds on multiplicities
We consider symmetric (as well as multi-symmetric) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of fixed degrees. We give polynomial (in the dimension of the ambient space) bounds on the number of irreducible representations of the symmetric group which acts on these sets, as well as their multip...
متن کاملSome Properties of Projective Semi-Symmetric Connections
We investigate the properties of projective semisymmetric connections of a Riemannian manifold. Some interesting results with respect to the invariant of this semi-symmetric connection are given. Mathematics Subject Classification: 53C12
متن کاملSymmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
Many polynomial systems have solution sets comprised of multiple irreducible components, possibly of different dimensions. A fundamental problem of numerical algebraic geometry is to decompose such a solution set, using floating-point numerical processes, into its components. Prior work has shown how to generate sets of generic points guaranteed to include points from every component. Furthermo...
متن کاملSemi-classical open string corrections and symmetric Wilson loops
In AdS/CFT correspondence, an AdS2×S D3-brane with electric flux in AdS5× S5 spacetime corresponds to a circular Wilson loop of symmetric representation or a multiply wound one in N = 4 super Yang-Mills theory. In order to distinguish the symmetric loop and the multiply wound loop, one should see an exponentially small correction in large ’t Hooft coupling. We study semi-classically the disk op...
متن کاملOn Polynomial Optimization Over Non-compact Semi-algebraic Sets
We consider the class of polynomial optimization problems inf{f(x) : x ∈ K} for which the quadratic module generated by the polynomials that define K and the polynomial c − f (for some scalar c) is Archimedean. For such problems, the optimal value can be approximated as closely as desired by solving a hierarchy of semidefinite programs and the convergence is finite generically. Moreover, the Ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2011
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1103175s